$\lambda(n,k)$-parameter families and associated convex functions
نویسندگان
چکیده
منابع مشابه
Generalized Hypergeometric Functions and Associated Families of k-Uniformly Convex and k-Starlike Functions
In this lecture, we aim at presenting a certain linear operator which is defined by means of the Hadamard product (or convolution) with a generalized hypergeometric function and then investigating its various mapping as well as inclusion properties involving such subclasses of analytic and univalent functions as (for example) k-uniformly convex functions and k-starlike functions. Relevant conne...
متن کاملClose-to-convex Functions and Linear-invariant Families
correct. We shall modify this result for linear-invariant families. Families of closeto-convex functions and of functions of bounded boundary rotation will be showed to be linear-invariant. Because of the coefficient estimate for close-to-convex functions and functions of bounded boundary rotation derived by Aharonov and Friedland [1], it is possible to get the distortion theorem for the n-th. ...
متن کاملGeneralised Exponential Families and Associated Entropy Functions
A generalised notion of exponential families is introduced. It is based on the variational principle, borrowed from statistical physics. It is shown that inequivalent generalised entropy functions lead to distinct generalised exponential families. The well-known result that the inequality of Cramér and Rao becomes an equality in the case of an exponential family can be generalised. However, thi...
متن کاملHigher order close-to-convex functions associated with Attiya-Srivastava operator
In this paper, we introduce a new class$T_{k}^{s,a}[A,B,alpha ,beta ]$ of analytic functions by using a newly defined convolution operator. This class contains many known classes of analytic and univalent functions as special cases. We derived some interesting results including inclusion relationships, a radius problem and sharp coefficient bound for this class.
متن کاملL-convex Functions and M-convex Functions
In the field of nonlinear programming (in continuous variables) convex analysis [22, 23] plays a pivotal role both in theory and in practice. An analogous theory for discrete optimization (nonlinear integer programming), called " discrete convex analysis " [18, 17], is developed for L-convex and M-convex functions by adapting the ideas in convex analysis and generalizing the results in matroid ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Rocky Mountain Journal of Mathematics
سال: 1978
ISSN: 0035-7596
DOI: 10.1216/rmj-1978-8-3-491